An exact solution approach for the inventory routing problem with time windows

• We study the Inventory Routing Problem with Time Windows (IRPTW). provide a mixed integer linear programming formulation that includes both arc and routebased variables. develop an efficient branch-price-and-cut algorithm to solve IRPTW optimally. generate two sets of data considering time-varying time-invariant demands at retailers. demonstrate efficacy our solution approach through computational experiments. The inventory routing problem (IRP) is integrated transportation planning jointly determines replenishment schedules for given set retailers, decisions supplier distributes product retailers over finite horizon typically consisting multiple periods. In classical IRP, are assumed accept deliveries any time during period. However, this assumption does not always hold in practice. Although central decision maker, may also have operational restrictions preventing them from receiving arbitrary times. With motivation, we IRP windows exact it. particular, propose algorithm, which, best knowledge, first specifically designed solving IRPTW. Our involves route based variables obtain easier structure pricing problems. use valid inequalities – originally derived lot sizing strengthen formulation. results conducted on newly generated benchmark instances effectiveness which capable identifying optimal or fairly good solutions medium large reasonable computation